Progressive Geometry Compression for Meshes

نویسندگان

  • Xinguo Liu
  • Hujun Bao
  • Qunsheng Peng
  • Pheng-Ann Heng
  • Tien-Tsin Wong
  • Hanqiu Sun
چکیده

A novel progressive geometry compression scheme is presented in the paper. In this scheme a mesh is represented as a base mesh followed by some groups of vertex split operations using an improved simplification method, in which each level of the mesh can be refined into the next level by carrying out a group of vertex split operations in any order. Consequently, the PM representation can be effectively encoded by permuting the vertex split operations in each group. Meanwhile, a geometry predicator using Laplacian operator is designed to predict each new vertex position using its neighbors. The correction is quantized and encoded using Huffman coding scheme. Experimental results show that our algorithm obtains higher compression ratios than the previous work. It is very suitable for progressive transmission of geometry models over Internet.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compressed Progressive Meshes

ÐMost systems that support visual interaction with 3D models use shape representations based on triangle meshes. The size of these representations imposes limits on applications for which complex 3D models must be accessed remotely. Techniques for simplifying and compressing 3D models reduce the transmission time. Multiresolution formats provide quick access to a crude model and then refine it ...

متن کامل

A Framework for Data-driven Progressive Mesh Compression

Progressive mesh compression techniques have reached very high compression ratios. However, these techniques usually do not take into account associated properties of meshes such as colors or normals, no matter their size, nor do they try to improve the quality of the intermediate decompression meshes. In this work, we propose a framework that uses the associated properties of the mesh to drive...

متن کامل

Cluster-based Random Accessible and Progressive Lossless Compression of Colored Triangular Meshes for Interactive Visualization

This paper presents a new lossless, cluster-based randomly-accessible and progressive 3D triangular mesh compression scheme. The scheme is targeted at the visualization of large meshes, supporting the encoding of vertex colors. We have extended the previous approach of [3] by using the progressive mesh encoder of [6] to compress the face clusters. The schemes were modified to prevent duplicatio...

متن کامل

Progressive compression of arbitrary textured meshes

In this paper, we present a progressive compression algorithm for textured surface meshes, which is able to handle polygonal non-manifold meshes as well as discontinuities in the texture mapping. Our method applies iterative batched simplifications, which create high quality levels of detail by preserving both the geometry and the texture mapping. The main features of our algorithm are (1) gene...

متن کامل

Compression of Normal Meshes

Normal meshes were recently introduced as a new way to represent geometry. A normal mesh is a multiresolution representation which has the property that all details lie in a known normal direction and hence the mesh depends only on a single scalar per vertex. Such meshes are ideally suited for progressive compression. We demonstrate such a compression algorithm for normal meshes representing co...

متن کامل

An efficient subdivision inversion for wavemesh-based progressive compression of 3D triangle meshes

Wavemesh is a powerful scheme for 3D triangular mesh processing. In sharp contrast with other approaches using wavelets for mesh compression which apply only to meshes having subdivision connectivity, Wavemesh can simplify, approximate, and compress meshes even if they do not respect this constraint, with unmatched results for progressive lossless compression when compared to other approaches. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000